Ela on Minimal Rank over Finite Fields∗
نویسنده
چکیده
Let F be a field. Given a simple graph G on n vertices, its minimal rank (with respect to F ) is the minimum rank of a symmetric n× n F -valued matrix whose off-diagonal zeroes are the same as in the adjacency matrix of G. If F is finite, then for every k, it is shown that the set of graphs of minimal rank at most k is characterized by finitely many forbidden induced subgraphs, each on at most ( |F | k 2 + 1)2 vertices. These findings also hold in a more general context.
منابع مشابه
Computing the Rank of Large Sparse Matrices over Finite Fields
We want to achieve efficient exact computations, such as the rank, of sparse matrices over finite fields. We therefore compare the practical behaviors, on a wide range of sparse matrices of the deterministic Gaussian elimination technique, using reordering heuristics, with the probabilistic, blackbox, Wiedemann algorithm. Indeed, we prove here that the latter is the fastest iterative variant of...
متن کاملEla Graphs Whose Minimal Rank Is Two: the Finite Fields Case∗
Let F be a finite field, G = (V, E) be an undirected graph on n vertices, and let S(F,G) be the set of all symmetric n× n matrices over F whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let mr(F,G) be the minimum rank of all matrices in S(F,G). If F is a finite field with pt elements, p = 2, it is shown that mr(F,G) ≤ 2 if and only if the compl...
متن کاملThe minimum rank problem over the finite field of order 2:minimum rank 3
Abstract Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by exploring how some of these results over the finite field of order 2 extend to arbitrary fields and demonstrate that at least one third of the 62 ar...
متن کاملAlgebras of Minimal Rank over Perfect Fields
Let R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative algebra A. A fundamental lower bound for R(A) is the so-called Alder– Strassen boundR(A) 2 dimA t, where t is the number of maximal twosided ideals of A. The class of algebras for which the Alder–Strassen bound is sharp, the so-called algebras of minimal rank, has received a wide attention in algebrai...
متن کاملOn minimal rank over finite fields
Let F be a field. Given a simple graph G on n vertices, its minimal rank (with respect to F ) is the minimum rank of a symmetric n× n F -valued matrix whose off-diagonal zeroes are the same as in the adjacency matrix of G. If F is finite, then for every k, it is shown that the set of graphs of minimal rank at most k is characterized by finitely many forbidden induced subgraphs, each on at most ...
متن کامل